Performance assessment of Hamming Code
نویسندگان
چکیده
Hamming codes can detect up to two simultaneous bit errors, and correct single-bit errors; thus, reliable communication is possible when the Hamming distance between the transmitted and received bit patterns is less than or equal to one. By contrast, the simple parity code cannot correct errors, and can only detect an odd number of errors. We will analyze hamming code with simulations (using Hardware description language, VHDL) that shows minimum occurrence of error bits for all the data bits. The simulation handles errors two or more errors will cause an incorrect syndrome value. To deal with this problem, another check bit can be added to establish even parity over all other output bits, data and check. An even number of bit errors can now be detected (but not corrected) [12].
منابع مشابه
Assessment of Weighting Functions Used in Oppermann Codes in Polyphase Pulse Compression Radars
Polyphase is a common class of pulse compression waveforms in the radar systems. Oppermann code is one of the used codes with polyphone pattern. After compression, this code has little tolerant against Doppler shift in addition to its high side lobe level. This indicates that the use of Oppermann code is an unsuitable scheme to radars applications. This paper shows that the use of amplitude wei...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملHccc and Slbc for Audio Signals
This paper gives two lossless speech compression schemes Hamming correction codes compressor (HCCC) and Systematic Linear Block Code Compressor (SLBC) based on error correcting Hamming code and systematic linear block codes respectively. Hamming codes are a family of linear errorcorrecting codes that can detect up to two-bit errors or correct one-bit errors. Systematic linear block code is any ...
متن کاملOn the erasure-correcting capabilities of low-complexity decoded LDPC codes with constituent Hamming codes
Low-density parity-check (LDPC) codes can be constructed using constituent block codes other than single parity-check (SPC) codes. This paper considers random LDPC codes with constituent Hamming codes and investigates their asymptotic performance over the binary erasure channel. It is shown that there exist Hamming code-based LDPC codes which, when decoded with a low-complexity iterative algori...
متن کاملReed-Muller Codec Simulation Performance
The approach to error correction coding taken by modern digital communication systems started in the late 1940’s with the ground breaking work of Shannon, Hamming and Golay. ReedMuller (RM) codes were an important step beyond the Hamming and Golay codes because they allowed more flexibility in the size of the code word and the number of correctable errors per code word. Whereas the Hamming and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011